XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks Roger Wattenhofer and Aaron Zollinger {wattenhofer, zollinger}@inf.ethz.ch Department of Computer Science, ETH Zurich 8092 Zurich, Switzerland

Source URL: disco.ethz.ch

• Graph theory
• Mathematics
• NP-complete problems
• Spanning tree
• Edsger W. Dijkstra
• Routing algorithms
• Search algorithms
• Topology control
• Unit disk graph
• Connectivity
• Minimum spanning tree
• Bipartite graph

Constrained Level Generation through Grammar-Based Evolutionary Algorithms Jose M. Font*1 , Roberto Izquierdo2 , Daniel Manrique2 , and Julian Togelius3 1 U-tad, Centro Universitario de Tecnolog´ıa y Arte Digital, C/P

Source URL: julian.togelius.com

• Graph theory
• Procedural generation
• Cycle
• Graph coloring
• NP-complete problems
• Book:Graph Theory

Hamilton cycles in graphs and hypergraphs: an extremal perspective Abstract. As one of the most fundamental and well-known NP-complete problems, the Hamilton cycle problem has been the subject of intensive research. Rece

Source URL: web.mat.bham.ac.uk

Storytelling and Clustering for Cellular Signaling Pathways M. Shahriar Hossain, Monika Akbar, Nicholas F. Polys Department of Computer Science, Virginia Tech, Blacksburg, VA 24061, USA. {msh, amonika, npolys}@vt.edu ABS

Source URL: www.cs.utep.edu

• Cluster analysis
• Data mining
• Geostatistics
• Graph operations
• Planar graphs
• NP-complete problems
• HCS clustering algorithm

Balls into bins via local search: cover time and maximum load Karl Bringmann1 , Thomas Sauerwald2 , Alexandre Stauffer3 , and He Sun1 1 2

Source URL: people.mpi-inf.mpg.de

• Graph theory
• Mathematics
• Expander graph
• Balls into bins
• NP-complete problems
• Quiver
• Eternal dominating set

In Intl. J. of Robotics Research 23(9):, September2004 A formal analysis and taxonomy of task allocation in multi-robot systems Brian P. Gerkey Artificial Intelligence Lab

Source URL: robotics.stanford.edu

• Mathematics
• NP-complete problems
• Combinatorics
• Discrete mathematics
• Operations research
• Theoretical computer science
• Combinatorial optimization
• Greedy algorithm
• Matroid theory
• Robotics
• Robot
• Assignment problem

SYNC or ASYNC: Time to Fuse for Distributed Graph-Parallel Computation Chenning Xie† Rong Chen†

Source URL: ipads.se.sjtu.edu.cn

• Graph theory
• Mathematics
• Discrete mathematics
• Graph coloring
• NP-complete problems
• Vertex
• Neighbourhood
• Distance

Kenken For Teachers Tom Davis http://www.geometer.org/mathcircles June 27, 2010

Source URL: www.geometer.org

• Logic puzzles
• NP-complete problems
• Mathematics
• Recreational mathematics
• Puzzles
• Leisure
• Puzzle video games
• KenKen
• Crossword
• Sudoku
• 15 puzzle
• Futoshiki

Lower and Upper Competitive Bounds for Online Directed Graph ExplorationI Klaus-Tycho Foerstera,1,∗, Roger Wattenhofera a ETH Z¨

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Combinatorial optimization
• Edsger W. Dijkstra
• Routing algorithms
• Search algorithms
• NP-complete problems
• Graph traversal
• Shortest path problem
• Matching
• A* search algorithm
• Planar graph

Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma †

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Computational complexity theory
• Spanning tree
• NP-complete problems
• Dominating set
• Minimum spanning tree
• Maximal independent set
• Matching
• Travelling salesman problem
• Shortest path problem
• Tree